Stochastic optimization-based approach for multifingered grasps synthesis
نویسندگان
چکیده
In this paper, we propose an approach for computing suboptimal grasps of polyhedral objects. Assuming n hard-finger contact with Coulomb friction model and based on central axes of the grasp wrench, we develop a new necessary and sufficient condition for n-finger grasps to achieve force-closure property. Accordingly, we reformulate the proposed force-closure test as a new linear programming problem, which we solve using an Interior Point Method. Furthermore, we present an approach for finding appropriate stable grasps for a robotic hand on arbitrary objects. We use the Simulated Annealing technique for synthesizing suboptimal grasps of 3D objects. Through numerical simulations on arbitrary shaped objects, we show that the proposed approach is able to compute good grasps for multifingered hands within a reasonable computational time.
منابع مشابه
Classification of grasps by multifingered robot hands
This research characterizes grasping by multifingered robot hands through an investigation of the space of contact forces between fingers and the grasped object. By decomposing the space of contact forces into four subspaces, we develop a method to determine the dimensions of the subspaces with respect to the connectivity of the object. The relationship we obtain reveals the diflkrences between...
متن کاملGrasp analysis and synthesis based on a new quantitative measure
In this paper, we present a quantitative measure of multifingered grasps. The measure quantifies the capability of a grasp in firmly holding an object while resisting external loads and/or disturbances. It can also be used for qualitative test of closure properties (form closure and force closure). For planar grasps and frictionless three-dimensional (3-D) grasps, the quantitative measure can b...
متن کاملReal-Time Grasp Planning for Multi-Fingered Hands by Finger Splitting
Grasp planning for multi-fingered hands is computationally expensive due to the joint-contact coupling, surface nonlinearities and high dimensionality, thus is generally not affordable for real-time implementations. Traditional planning methods by optimization, sampling or learning work well in planning for parallel grippers but remain challenging for multifingered hands. This paper proposes a ...
متن کاملSynthesis and Optimization of Force Closure Grasps via Sequential Semidefinite Programming
In this paper we present a novel approach for synthesizing and optimizing both positions and forces in force closure grasps. This problem is a non-convex optimization problem in general since it involves constraints that are bilinear; in particular, computing wrenches involves a bilinear product between grasp contact points and contact forces. Thus, conventional approaches to this problem typic...
متن کاملFinger Form - Closure Grasps on Polygonal Objects
This paper presents an efficient algorithm for computing all n-finger form-closure grasps on a polygonal object based on a new sufficient and necessary condition for form-closure. With this new condition, it is possible to transfer the problem of computing the form-closure grasp in R3 to one in R1. We demonstrate that the non-form-closure grasps consist of two convex polytopes in the space of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Robotica
دوره 28 شماره
صفحات -
تاریخ انتشار 2010